DNA algorithm for breaking a propositional logic based cryptosystem

نویسندگان

  • Rani Siromoney
  • Bireswar Das
چکیده

This is to certify that this thesis titled " DNA Cryptology: A Brief Survey And A DNA Algorithm For Breaking A Propositional Logic Based Cryptosystem " submitted by Bireswar Das towards partial fulfillment of requirements for the degree of M.Tech. in Computer Science at Indian Statistical Institute, Kolkata embodies the work done under my supervision. i Acknowledgments I take pleasure in thanking Dr. Rana Barua for his guidance, advice, encouragement and highly helpful criticism throughout the dissertation period. His pleasant and encouraging words have always kept my spirits up. I would also like to thank Dr. Rani Siromoney for motivating me into this field and for granting me permission to include the paper [24] in this thesis. My felicitation also goes to Shantanu Das for providing me all the help during the period I worked.

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

Logic-Based Abduction New Polynomial Classes for Logic-Based Abduction

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of ...

متن کامل

Breaking an orbit-based symmetric cryptosystem

We report a break for a recently proposed class of cryptosystems. The cryptosystem uses constant points of a periodic secret orbit to encrypt the plaintext. In order to break the system, it suffices to sort the constant points and find the initial fixed point. We also report breaks for the modified versions of the cryptosystem. Besides, we discuss some efficiency issues of the the cryptosystem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • Bulletin of the EATCS

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2003